An optimum nonlinear code
نویسندگان
چکیده
منابع مشابه
Optimum Nonlinear
| This paper is composed of two parts. The rst part surveys the literature regarding optimum nonlinear l-tering from the (continuous-time) stochastic analysis point of view, and the other part explores the impact of recent applications of neural networks (in a discrete-time context) to nonlinear ltering. In particular, the results obtained by using a regularized form of radial basis function (R...
متن کاملControl of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller
This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...
متن کاملControl of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller
This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...
متن کاملOPTIMUM WEIGHTED MODE COMBINATION FOR NONLINEAR STATIC ANALYSIS OF STRUCTURES
In recent years some multi-mode pushover procedures taking into account higher mode effects, have been proposed. The responses of considered modes are combined by the quadratic combination rules, while using the elastic modal combination rules in the inelastic phases is not valid. Here, an optimum weighted mode combination method for nonlinear static analysis is presented. Genetic algorithm is ...
متن کاملAn Optimum Decision
The concept of rejection is extended to that of class-selective rejection. That is, when an input pattern cannot be reliably assigned to one of the N classes in a N-class problem, it is assigned to a subset of classes that are most likely to issue the pattern, instead of simply rejecting the pattern. First, a new optimality criterion is appropriately deened to accommodate the newly introduced d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1967
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(67)90835-2